منابع مشابه
Compiling Problem Specifications into SAT
We present a compiler that translates a problem specification into a propositional satisfiability test (SAT). Problems are specified in a logic-based language, called NP-SPEC, which allows the definition of complex problems in a highly declarative way, and whose expressive power is such as to capture all problems which belong to the complexity class NP. The target SAT instance is solved using a...
متن کاملCompiling Problem Speci cations into SAT
We present a compiler that translates a problem speciica-tion into a propositional satissability test (SAT). Problems are speciied in a logic-based language, called np-spec, which allows the deenition of complex problems in a highly declarative way, and whose expressive power is such to capture exactly all problems which belong to the complexity class NP. The target SAT instance is solved using...
متن کاملCompiling ER Specifications into Declarative Programs
This paper proposes an environment to support high-level database programming in a declarative programming language. In order to ensure safe database updates, all access and update operations related to the database are generated from high-level descriptions in the entityrelationship (ER) model. We propose a representation of ER diagrams in the declarative language Curry so that they can be con...
متن کاملCompiling Modechart Specifications
The Modechart specification language is a formalism for the specification of real-time systems. A toolset for specification, analysis and simulation for Modechart specifications exists for supporting the design and construction of real-time systems [CHLR93]. This paper introduces a new tool in the the toolset: a compiler for a class of Modechart specifications, namely, that of deterministic sys...
متن کاملCompiling dyadic first-order specifications into map algebra
Two techniques are designed for eliminating quantifiers from an existentially quantified conjunction of dyadic literals, in terms of the operators ◦, ∩, and −1 of the Tarski-ChinGivant formalism of relations. The use of such techniques is illustrated through increasingly challenging examples, and their algorithmic complexity is assessed.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 2005
ISSN: 0004-3702
DOI: 10.1016/j.artint.2004.01.006